The prime-pair conjectures of Hardy and Littlewood
نویسنده
چکیده
By (extended) Wiener–Ikehara theory, the prime-pair conjectures are equivalent to simple pole-type boundary behavior of corresponding Dirichlet series. Under a weak Riemann-type hypothesis, the boundary behavior of weighted sums of the Dirichlet series can be expressed in terms of the behavior of certain double sums Σ 2k(s). The latter involve the complex zeros of ζ(s) and depend in an essential way on their differences. Extended prime-pair conjectures are true if and only if the sums Σ 2k(s) have good boundary behavior. Equivalently, a more general sum Σ ω(s) (with real ω > 0) should have a boundary function (or distribution) that is well-behaved, apart from a pole R(ω)/(s − 1/2) with residue R(ω) of period 2. [R(ω) could be determined for ω ≤ 2.] c ⃝ 2011 Royal Dutch Mathematical Society (KWG). Published by Elsevier B.V. All rights reserved.
منابع مشابه
A Generalization of a Conjecture of Hardy and Littlewood to Algebraic Number Fields
We generalize conjectures of Hardy and Littlewood concerning the density of twin primes and k-tuples of primes to arbitrary algebraic number fields. In one of their great Partitio Numerorum papers [7], Hardy and Littlewood advance a number of conjectures involving the density of pairs and k-tuples of primes separated by fixed gaps. For example, if d is even, we define Pd(x) = |{0 < n < x : n, n...
متن کاملPrime pairs and the zeta function
Are there infinitely many prime pairs with given even difference? Most mathematicians think so. Using a strong arithmetic hypothesis, Goldston, Pintz and Yildirim have recently shown that there are infinitely many pairs of primes differing by at most sixteen. There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood [G.H. Hardy, J.E. Littlewood, Some probl...
متن کاملBinary Additive Problems: Theorems of Landau and Hardy-littlewood Type
We prove theorems of Landau and Hardy-Littlewood type for Goldbach, Chen, Lemoime-Levy and other binary partitions of positive integers. We also pose some new conjectures.
متن کاملLower Bound for the Remainder in the Prime-pair Conjecture
Taking r > 0 let π2r(x) denote the number of prime pairs (p, p+ 2r) with p ≤ x. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that π2r(x) ∼ 2C2r li2(x) with an explicit constant C2r > 0. A heuristic argument indicates that the remainder e2r(x) in this approximation cannot be of lower order than x , where β is the supremum of the real parts of zeta’s zeros. The argument also s...
متن کاملMean Value One of Prime-pair Constants
For k > 1, r 6= 0 and large x, let π 2r (x) denote the number of prime pairs (p, p+2r) with p ≤ x. By the Bateman–Horn conjecture the function π 2r(x) should be asymptotic to (2/k)C k 2rli2(x), with certain specific constants C 2r . Heuristic arguments lead to the conjecture that these constants have mean value one, just like the Hardy–Littlewood constants C2r for prime pairs (p, p + 2r). The c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012